A Novel Image Encryption Using an Integration Technique of Blocks Rotation Based on the Magic Cube and the AES Algorithm

In recent years, several encryption algorithms have been proposed to protect digital images from cryptographic attacks. These encryption algorithms typically use a relatively small key space and therefore, provide safe, especially if they are of a dimension. In this paper proposes an encryption algorithm for a new image protection scheme based on the rotation of the faces of a Magic Cube. The original image is divided into six sub-images and these sub-images are divided amongst a number of blocks and attached to the faces of a Magic Cube. The faces are then scrambled using rotation of the Magic Cube. Then the rotated image is fed to the AES algorithm which is applied to the pixels of the image to encrypt the scrambled image. Finally, experimental results and security analysis show that the proposed image encryption scheme not only encrypts the picture to achieve perfect hiding, but the algorithm can also withstand exhaustive, statistical and differential attacks

A New Image Scrambling Technique using Block Rotation Algorithm based on Rubik’s Cube

Background:. Image scrambling is a useful approach to secure the image data by scrambling the image into an unintelligible format. The relationship among the adjacent pixels of image is very high. Also, Most image scrambling algorithms apply one iteration level scrambling that cause a high possibility of occurs the weakness of visual leakage on the image scrambling algorithm which can be reflected by the corresponding scrambled image. Objectives: the objective of this paper is to develop a new efficient image scrambling algorithm by using the Rotation technique in order to break the relationship among image elements (pixels). Thus, to develop an efficient scheme to generate non fixed iteration in the image scrambling algorithm in order to eliminate the problem of visual leakage. Results: The results show that the correlation between image elements has been significantly decreased using the proposed technique, and higher entropy has been achieved. Furthermore, implies a high similarity and a good quality of the retrieved image compared to the original image. Conclusion: This paper proposes a new scramble algorithm which can be produced by a series of rotation the rows and the columns into six sub-image that attached to the faces of the virtual Rubik’s cube. The first part of the algorithm aims to build a rotation table using hash function within scramble phase and descramble phase to generate a scrambled (rotated) image and the retrieved image. The second part of the algorithm uses the rotation table resulted from the first part of the algorithm to generate newly rotated image (Scrambled) in which the rows and the columns of the original image are rotated after divide it to six sub-image and attach then to the faces of the virtual Rubik’s cube . This makes the scrambled images difficult to decode thus providing a high level of security protection for the images. The algorithm can be applied in the real-time applications since it is a straightforward process and easily implemented

A New Image Scrambling Approach using Block-Based on Shifted Algorithm

Image scrambling is a useful approach to secure the image data by scrambling the image into an unintelligible format. This paper proposes a new scramble algorithm which can be produced by a series of shifting the rows and the columns. The first part of the algorithm aims to build a shifted table using hash function within scramble phase and descramble phase to generate an scrambled (shifted) image and the retrieved image. The second part of the algorithm uses the shifted table resulted from the first part of the algorithm to generate newly shifted image (Scrambled) in which the rows and the columns of the original image are shifted. This makes the scrambled images difficult to decode thus providing a high level of security protection for the images. The results show that the correlation between image elements has been significantly decreased using the proposed technique, and higher entropy has been achieved. Furthermore, implies a high similarity and a good quality of the retrieved image compared to the original image. The algorithm can be applied in the real-time applications since it is a straightforward process and easily implemented

A Novel Reversible Data Hiding Technique with High Capacity and Less Overhead Information

In this paper, a new reversible image hiding scheme based on histogram shifting for grayscale images is proposed. As is known, the payload storage of histogram-based reversible data hiding is impacted by the overhead information of the pixel positions that have to be embedded in a cover image. To solve this problem, the cover image is divided into two parts, namely the Most Significant Part (MSP) and the Least Significant Part (LSP), secret data is hidden by shifting the histogram of the most significant part. To increase the payload of embedded data in a cover image, the proposed algorithm reduces the number of bits that represent the secret data without any corruption of that secret data. In addition, overflow and underflow problems are prevented by categorization of the histogram into three categories. According to the experimental results, the cover image is recovered correctly. A higher hiding capacity can be obtained and a good quality marked image is preserved when the proposed scheme is applied to hide the secret data by shifting the histogram of the most significant part instead of hiding by shifting the histogram of the whole cover image